A Polylogarithmic-Competitive Algorithm for the k -Server Problem
نویسندگان
چکیده
منابع مشابه
Polylogarithmic Competitive Ratios for the Randomized Online k-server Problem
In this paper, we will study recent work on and progress towards polylogarithmic competitive ratios for the k-server problem. For a long time, the best known competitive ratio that held for general metric spaces was 2k − 1, shown by Koutsoupias and Papadimitriou [3] in 1995. A paper by Coté et al. [7] in 2008 gave a randomized algorithm with a O(log ∆) competitive ratio for k-server on binary t...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms
We consider the k-server problem [23] in a distributed setting. Given a network of n processors, and k identical mobile servers, requests for service appear at the processors and a server must reach the request-point. Besides modeling problems in computer networks where k identical mobile resources are shared by the processors of the network, this models a realistic situation where the transfer...
متن کاملThe Harmonic Algorithm for k - server Problem
The online k-server problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the tth request is received, one of the servers must be moved from its location to xt. An online k-server algorithm makes the choice of which server is moved in each ste...
متن کاملA Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to its request. The special case where the requests are points on the real line is known as the CNNproblem. It has been a well-known open question if an algorithm with a constant competitive ratio exists for this problem....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2015
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2783434